Constraint-Based Association Rule Mining
نویسنده
چکیده
منابع مشابه
A Review of Negative and Positive Association rule mining with multiple constraint and correlation factor
Negative and positive association rule mining is extract needful information for large database. The generation of negative and positive rule based on interesting pattern and noninteresting pattern of database. The violation of given threshold value such as minimum support and minimum confidence generate some negative rules. The generation of association rule mining dependent some algorithm suc...
متن کاملData sanitization in association rule mining based on impact factor
Data sanitization is a process that is used to promote the sharing of transactional databases among organizations and businesses, it alleviates concerns for individuals and organizations regarding the disclosure of sensitive patterns. It transforms the source database into a released database so that counterparts cannot discover the sensitive patterns and so data confidentiality is preserved ag...
متن کاملTowards Interesting Patterns of Hard CSPs with Functional Constraints
The hardness of finite domain Constraint Satisfaction Problems (CSPs) is an important research topic in Constraint Programming (CP) community. In this paper, we study the association rule mining techniques together with rule deduction and propose a cascaded approach to extract interesting patterns of hard CSPs with functional constraints. Specifically, we generate random CSPs, collect controlli...
متن کاملDiscovering Active and Profitable Patterns with Rfm (recency, Frequency and Monetary) Sequential Pattern Mining–a Constraint Based Approach
Sequential pattern mining is an extension of association rule mining that discovers time-related behaviors in sequence database. It extends association by adding time to the transactions. The problem of finding association rules concern with intratransaction patterns whereas that of sequential pattern mining concerns with inter-transaction patterns. Generalized Sequential Pattern (GSP) mining a...
متن کاملTowards the Patterns of Hard CSPs with Association Rule Mining
The hardness of finite domain Constraint Satisfaction Problems (CSPs) is a very important research area in Constraint Programming (CP) community. However, this problem has not yet attracted much attention from the researchers in the association rule mining community. As a popular data mining technique, association rule mining has an extremely wide application area and it has already been succes...
متن کامل